Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines

نویسنده

  • Conan Mukherjee
چکیده

We first provide the complete characterization of mechanisms that satisfy weak group strategy-proofness and queue-efficiency in the multiple machine queueing problem with two agents. For any such mechanism, there can be at most one point of discontinuity in the transfer map. We then state a necessary condition for mechanisms to satisfy queue-efficiency, weak group strategy-proofness and continuity, with more than two agents. Finally, we provide a class of mechanisms that satisfy queue-efficiency, weak group strategy-proofness and continuity. JEL classification: D71; D82; D74

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Machine Repair Queueing System with with Non-Reliable Service Stations And Heterogeneous Service Discipline (RESEARCH NOTE)

This investigation deals with M/M/R/N machine repair problem with R non-reliable service stations which are subjected to unpredictable breakdown. 1here is provision of an additional server to reduce backlog in the case of heavy load of failed machines. 1he permanent service stations repair the failed machines at an identical rate m and switch to faster repair rate when all service stations are ...

متن کامل

N-Policy for M/G/1 Machine Repair Model with Mixed Standby Components, Degraded Failure and Bernoulli Feedback

In this paper, we study N-policy for a finite population Bernoulli feedback queueing model for machine repair problem with degraded failure. The running times of the machines between breakdowns have an exponential distribution. The repair times of the machines are independent and identically distributed random variables. If at any time a machine fails, it is sent to the repairman for repairing,...

متن کامل

Multiple vacation policy for MX/Hk/1 queue with un-reliable server

This paper studies the operating characteristics of an MX/Hk/1 queueing system under multiple vacation policy. It is assumed that the server goes for vacation as soon as the system becomes empty. When he returns from a vacation and there is one or more customers waiting in the queue, he serves these customers until the system becomes empty again, otherwise goes for another vacation. The brea...

متن کامل

Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers‎

This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...

متن کامل

Partial-Fraction Decomposition Approach to the M/H2/2 Queue

Here, a two server queueing system with Poisson arrivals and two different types of customers (M/H2/2 queue) is analyzed. A novel straightforward method is presented to acquire the exact and explicit forms of the performance measures. First, the steady state equations along with their Z-transforms are derived for the aforementioned queueing system. Using some limiting behaviors of the steady-st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Game Theory

دوره 42  شماره 

صفحات  -

تاریخ انتشار 2013